Towards Limit Computable Mathematics
نویسندگان
چکیده
The notion of Limit-Computable Mathematics (LCM) will be introduced. LCM is a fragment of classical mathematics in which the law of excluded middle is restricted to 0 2 -formulas. We can give an accountable computational interpretation to the proofs of LCM. The computational content of LCM-proofs is given by Gold's limiting recursive functions, which is the fundamental notion of learning theory. LCM is expected to be a right means for \Proof Animation," which was introduced by the rst author [10]. LCM is related not only to learning theory and recursion theory, but also to many areas in mathematics and computer science such as computational algebra, computability theories in analysis, reverse mathematics, and many others.
منابع مشابه
A Limiting Rst Order Realizability Interpretation
Constructive Mathematics might be regarded as a fragment of classical mathematics in which any proof of an existence theorem is equipped with a computable function giving the solution of the theorem. Limit Computable Mathematics (LCM) considered in this note is a fragment of classical mathematics in which any proof of an existence theorem is equipped with a function computing the solution of th...
متن کاملTowards a Physically Meaningful Definition of Computable Discontinuous and Multi-Valued Functions (Constraints)
In computable mathematics, there are known definitions of computable numbers, computable metric spaces, computable compact sets, and computable functions. A traditional definition of a computable function, however, covers only continuous functions. In many applications (e.g., in phase transitions), physical phenomena are described by discontinuous or multi-valued functions (a.k.a. constraints)....
متن کاملComputational Problems in Metric Fixed Point Theory and their Weihrauch Degrees
We study the computational difficulty of the problem of finding fixed points of nonexpansive mappings in uniformly convex Banach spaces. We show that the fixed point sets of computable nonexpansive self-maps of a nonempty, computably weakly closed, convex and bounded subset of a computable real Hilbert space are precisely the nonempty, co-r.e. weakly closed, convex subsets of the domain. A unif...
متن کاملTowards A Theory Of Quantum Computability
We propose a definition of quantum computable functionsas mappings between superpositions of natural numbers to probabilitydistributions of natural numbers. Each function is obtained as a limitof an infinite computation of a quantum Turing machine. The class ofquantum computable functions is recursively enumerable, thus openingthe door to a quantum computability theory which...
متن کاملUncomputably Noisy Ergodic Limits
V’yugin [2, 3] has shown that there are a computable shift-invariant measure on 2 and a simple function f such that there is no computable bound on the rate of convergence of the ergodic averages Anf . Here it is shown that in fact one can construct an example with the property that there is no computable bound on the complexity of the limit; that is, there is no computable bound on how complex...
متن کامل